Simulation Methods for Queues: An Overview
نویسندگان
چکیده
This paper gives an overview of those aspects of simulation methodology that are (to some extent) peculiar to the simulation of queueing systems. A generalized semi-Markov process framework for describing queueing systems is used through much of the paper. The main topics covered are: output analysis for simulation of transient and steady-state quantities, variance reduction methods that exploit queueing structure, and gradient estimation methods for performance parameters associated with queueing networks.
منابع مشابه
Evaluation of Pareto/d/1/k Queue by Simulation
The finding that Pareto distributions are adequate to model Internet packet interarrival times has motivated the proposal of methods to evaluate steady-state performance measures of Pareto/D/1/k queues. Some limited analytical derivation for queue models has been proposed in the literature, but their solutions are often of a great mathematical challenge. To overcome such limitations, simulation...
متن کاملبهبود فرایند مدیریت بیمار در اورژانس با شبیه سازی (PROMETHEE) و روش پرامیتی
Introduction: This article proposes a method which could improve the performance of an Emergency Department (ED) in a large hospital in Tehran, where the long waiting times cause patients’ and ED staff ’s dissatisfaction. ED is considered as a bottleneck in hospitals. To reduce long waiting time and improve patient satisfaction, application of system improvement methods is required....
متن کاملOverview of Direct Numerical Simulation of Particle Entrainment in Turbulent Flows
An overview of removal and re-entrainment of particles in turbulent flows is presented. The procedure for the direct numerical simulation (DNS) of the Navier-Stokes equation via a pseudospectral method for simulating the instantaneous fluid velocity field is described. Particle removal mechanisms in turbulent flows in a duct are examined and effects of the near-wall coherent eddies on the parti...
متن کاملAnalysis of Pareto-Type/M/s/c finite buffer queues
The finding that Pareto distributions are adequate to model Internet packet interarrival times has motivated the proposal of methods to compute steady-state performance measures of Pareto/M/·/· queues. In this work we give an overview of some of these methods and compare them with an approach we have recently proposed, which combines embedding, uniformization and stochastic ordering techniques ...
متن کاملLongest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Queueing Syst.
دوره 3 شماره
صفحات -
تاریخ انتشار 1988